On Consensus Over Random Networks
نویسندگان
چکیده
We consider the decentralized consensus problem over random information networks. In such networks, the underlying graph of the network at a given time instance is random but independent of all other times. For such a framework, we present a simple necessary and sufficient criteria for asymptotic consensus using simple ergodicity and probabilistic arguments. Finally, we investigate a special case for which the decentralized consensus algorithm converges to the average of the initial values.
منابع مشابه
On Average Consensus over Stochastically Switching Directed Topologies
Average consensus is a canonical problem in wireless sensor networks. Wireless communication channels exhibit stochastic data loss due to multiple reasons including fading and interference. This note considers average consensus algorithms executed over communication topologies that vary probabilistically due to such effects. It is known that even in this case the state values will reach consens...
متن کاملReaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks
We study the outcomes of information aggregation in online social networks. Our main result is that networks with certain realistic structural properties avoid information cascades and enable a population to effectively aggregate information. In our model, each individual in a network holds a private, independent opinion about a product or idea, biased toward a ground truth. Individuals declare...
متن کاملTracking and Activity Recognition through Camera Networks
We consider the agreement problem over random information networks. In a random network, the existence of an information channel between a pair of unit sat each time instance is probability and independent of other channels; hence, the topology of the network varies over time. In such a frame work, we address the asymptotic agreement for the networked units via notions from stochastic stability...
متن کاملRandomized Consensus Processing over Random Graphs: Independence and Threshold
In this paper, we study randomized consensus processing over general random graphs. At time step k, each node will follow the standard consensus algorithm, or stick to current state by a simple Bernoulli trial with success probability pk. Connectivity-independent and arc-independent graphs are defined, respectively, to capture the fundamental independence of random graph processes with respect ...
متن کاملFour Challenges That Global Health Networks Face
Global health networks, webs of individuals and organizations with a shared concern for a particular condition, have proliferated over the past quarter century. They differ in their effectiveness, a factor that may help explain why resource allocations vary across health conditions and do not correspond closely with disease burden. Drawing on findings from recently concluded studies of eight gl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006